Independence of Ramsey theorem variants using ε 0 ∗
نویسنده
چکیده
We discuss the nite adjacent Ramsey theorem, one of the most recent independence results in Peano Arithmetic, and show some fascinating connections with two of the earliest examples of natural unprovability: the Paris–Kirby Hydra battles and the Paris–Harrington theorem. The proofs in this paper, together with the proofs for Goodstein sequences from [4], are particularly well suited for presentation in an introductory course on independence or proof theory.
منابع مشابه
Independence of Ramsey theorem variants using ε0, Draft
We discuss the Vnite adjacent Ramsey theorem, one of the most recent independence results in Peano Arithmetic, and show some fascinating connections with two of the earliest examples of natural unprovability: the Paris–Kirby Hydra battles and the Paris– Harrington theorem. The proofs in this paper, together with the proofs for Goodstein sequences from [4], are particularly well suited for prese...
متن کاملAn application of Ramsey theorem to stopping games
We prove that every two-player nonzero-sum deterministic stopping game with uniformly bounded payoffs admits an ε-equilibrium, for every ε > 0. The proof uses Ramsey Theorem that states that for every coloring of a complete infinite graph by finitely many colors there is a complete infinite subgraph which is monochromatic. 2002 Elsevier Science (USA). All rights reserved. JEL classification: ...
متن کاملZero-sum Dynamic Games and a Stochastic Variation of Ramsey Theorem
We show how a stochastic variation of Ramsey theorem can be used to prove the existence of the value, and to construct ε-optimal strategies, in two-player zero-sum dynamic games that have certain properties.
متن کاملA Density Version of a Geometric Ramsey Theorem
Let V be an n-dimensional affine space over the field with pd elements, p 6= 2. Then for every ε > 0 there is an n(ε) such that if n = dim(V ) n(ε) then any subset of V with more than εjV j elements must contain 3 collinear points (i.e., 3 points lying in a one-dimensional affine subspace).
متن کاملBook Ramsey Numbers and Quasi-randomness
A set of n triangles sharing a common edge is called a book with n pages and is denoted by Bn. It is known that the Ramsey number r (Bn) satisfies r (Bn) = (4 + o (1))n. We show that every red-blue edge coloring of Kb(4−ε)nc with no monochromatic Bn exhibits quasi-random properties when ε tends to 0. This implies that there is a constant c > 0 such that for every red-blue edge coloring of Kr(Bn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016